Fluorescent logic systems for sensing and molecular computation: structure–activity relationships in edge-detection
نویسندگان
چکیده
منابع مشابه
Fluorescent logic systems for sensing and molecular computation: structure-activity relationships in edge-detection.
Molecular logic-based computation continues to throw up new applications in sensing and switching, the newest of which is the edge detection of objects. The scope of this phenomenon is mapped out by the use of structure-activity relationships, where several structures of the molecules and of the objects are examined. The different angles and curvatures of the objects are followed with good fide...
متن کاملDNA-enabled integrated molecular systems for computation and sensing.
CONSPECTUS: Nucleic acids have become powerful building blocks for creating supramolecular nanostructures with a variety of new and interesting behaviors. The predictable and guided folding of DNA, inspired by nature, allows designs to manipulate molecular-scale processes unlike any other material system. Thus, DNA can be co-opted for engineered and purposeful ends. This Account details a small...
متن کاملinvestigation of single-user and multi-user detection methods in mc-cdma systems and comparison of their performances
در این پایان نامه به بررسی روش های آشکارسازی در سیستم های mc-cdma می پردازیم. با توجه به ماهیت آشکارسازی در این سیستم ها، تکنیک های آشکارسازی را می توان به دو دسته ی اصلی تقسیم نمود: آشکارسازی سیگنال ارسالی یک کاربر مطلوب بدون در نظر گرفتن اطلاعاتی در مورد سایر کاربران تداخل کننده که از آن ها به عنوان آشکارساز های تک کاربره یاد می شود و همچنین آشکارسازی سیگنال ارسالی همه ی کاربران فعال موجود در...
Edge Detection Using Fuzzy Logic
Edge detection is still difficult task in the image processing field. In this paper we implemented fuzzy techniques for detecting edges in the image. This algorithm also works for medical images. In this paper we also explained about Fuzzy inference system, which is more robust to contrast and lighting variations. KeywordsFuzzy, FIS.
متن کاملComputation in Logic and Logic in Computation
The theory of addition in the domains of natural (N), integer (Z), rational (Q), real (R) and complex (C) numbers is decidable; so is the theory of multiplication in all those domains. By Gödel’s Incompleteness Theorem the theory of addition and multiplication is undecidable in the domains of N, Z and Q; though Tarski proved that this theory is decidable in the domains of R and C. The theory of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Faraday Discussions
سال: 2015
ISSN: 1359-6640,1364-5498
DOI: 10.1039/c5fd00056d